Relaxation oscillations in a slow–fast modified Leslie–Gower model

In this paper, we prove the existence and uniqueness of relaxation oscillation cycle of a slow–fast modified Leslie–Gower model via the entry–exit function and geometric singular perturbation theory. Numerical simulations are also carried out to illustrate our theoretical result.     

Geometrically distinct solutions for Klein–Gordon–Maxwell systems with super-linear nonlinearities

This paper is concerned with the following Klein–Gordon–Maxwell system $\left\{\begin{array}{c}-△u+V\left(x\right)u-(2\omega +\varphi )\varphi u=f(x,u),x\in {\mathbb{R}}^3,\hfill \\ △\varphi =(\omega +\varphi )u^2,x\in {\mathbb{R}}^3,\hfill \end{array}\right.$where $\omega >0$ is a constant, $V$ and $f$ are periodic with respect to $x$. By combining deformation type arguments, Lusternik–Schnirelmann theory and some new tricks, we prove that the above system admits infinitely many geometrically distinct solutions under weaker superlinear conditions instead of the common super-cubic conditions on $f$. Our result seems new and extends the previous results in the literature.     

An improved generalized predictive control algorithm based on the difference equation CARIMA model for the SISO system with known strong interference

ABSTRACT

The single input single output (SISO) system with known strong interference is widely used in various occasions. Due to its strong interference, the control accuracy is hard to guarantee. To solve this problem, an improved generalized predictive control (IGPC) algorithm is developed. The IGPC firstly builds the difference equation CARIMA (Controlled Auto-Regressive Integrated Moving-Average) model of the SISO system and then treats the system as a two input single output (TISO) system and calculates its predictive vector, then transforms it into a SISO system and uses the TISO system predictive vector to calculate the SISO system control increment. A new parameter called phase coefficient is added to inhibit the control lag. Simulations are performed to make the comparison among the traditional GPC, PID control, velocity synchronization control (VSC), fuzzy adaptive PID control (FAPID), model-based robust PID control (BPID) and the IGPC. Results show that IGPC has best performance compared to the others. Finally, experiments are developed which proved that the IGPC algorithm has a higher accuracy in the SISO system with known strong interference than that of VSC.     

Anti‐Pasch optimal packings with triples

It is shown that for , there exists an optimal packing with triples on points that contains no Pasch configurations. Furthermore, for all (mod 6), there exists a pairwise balanced design of order , whose blocks are all triples apart from a single quintuple, and that has no Pasch configurations amongst its triples.     

Simultaneous quantification of ondansetron and tariquidar in rat and human plasma using a high performance liquid chromatography‐ultraviolet method

Ondansetron, a widely used antiemetic agent, is a P‐glycoprotein (P‐gp) substrate and therefore expression of P‐gp at the blood–brain barrier limits its distribution to the central nervous system (CNS), which was observed to be reversed by coadministration with P‐gp inhibitors. Tariquidar is a potent and selective third‐generation P‐gp inhibitor, and coadministration with ondansetron has shown improved ondansetron distribution to the CNS. There is currently no reported bioanalytical method for simultaneously quantifying ondansetron with a third‐generation P‐gp inhibitor. Therefore, we aimed to develop and validate a method for ondansetron and tariquidar in rat and human plasma samples. A full validation was performed for both ondansetron and tariquidar, and sample stability was tested under various storage conditions. To demonstrate its utility, the method was applied to a preclinical pharmacokinetic study following coadministration of ondansetron and tariquidar in rats. The presented method will be valuable in pharmacokinetic studies of ondansetron and tariquidar in which simultaneous determination may be required. In addition, this is the first report of a bioanalytical method validated for quantification of tariquidar in plasma samples.     

The (S−1,S) inventory model and its counterparts in queueing theory

We explore the relationship between the ($S?1,S$) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the ($S?1,S$) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.     

Infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm system

We consider the infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm (mDGH2) system. The infinite propagation speed is derived for the corresponding solution with compactly supported initial data that does not have compact support any longer in its lifespan.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.